Partitioning Bispanning Graphs into Spanning Trees
نویسندگان
چکیده
منابع مشابه
Partitioning Bispanning Graphs into Spanning Trees
Given a weighted bispanning graph B = (V, P, Q) consisting of two edge-disjoint spanning trees P and Q such that w(P ) < w(Q) and Q is the only spanning tree with weight w(Q), it is conjectured that there are |V | − 1 spanning trees with pairwise different weight where each of them is smaller than w(Q). This conjecture due to Mayr and Plaxton is proven for bispanning graphs restricted in terms ...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملBi-cyclic decompositions of complete graphs into spanning trees
We examine decompositions of complete graphs with an even number of vertices, K2n, into n isomorphic spanning trees. While methods of such decompositions into symmetric trees have been known, we develop here a more general method based on a new type of vertex labelling, called flexible q-labelling. This labelling is a generalization of labellings introduced by Rosa and Eldergill.
متن کاملSpanning Trees In Dense Graphs
1.1. Notation and definitions We will sometimes use + and Σ to denote disjoint unions of sets. V (G) and E(G) denote the vertex set and the edge set of the graph G, and we write v(G) = |V (G)| (order of G) and e(G) = |E(G)| (size of G). (A,B) or (A,B, E) denote a bipartite graph G = (V , E), where V = A+B, and E ⊂ A×B. In general, given any graph G and two disjoint subsets A,B of V (G), the pai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics in Computer Science
سال: 2009
ISSN: 1661-8270,1661-8289
DOI: 10.1007/s11786-009-0011-z